Rate scalable image compression in the wavelet domain

This thesis explores image compression in the wavelet transform domain. This the- sis considers progressive compression based on bit plane coding. The rst part of the thesis investigates the scalar quantisation technique for multidimensional images such as colour and multispectral image. Embedded coders such as SPIHT and SPECK are known to be very simple and e cient algorithms for compression in the wavelet do- main. However, these algorithms require the use of lists to keep track of partitioning processes, and such lists involve high memory requirement during the encoding process. A listless approach has been proposed for multispectral image compression in order to reduce the working memory required. The earlier listless coders are extended into three dimensional coder so that redundancy in the spectral domain can be exploited. Listless implementation requires a xed memory of 4 bits per pixel to represent the state of each transformed coe cient. The state is updated during coding based on test of sig- ni cance. Spectral redundancies are exploited to improve the performance of the coder by modifying its scanning rules and the initial marker/state. For colour images, this is done by conducting a joint the signi cant test for the chrominance planes. In this way, the similarities between the chrominance planes can be exploited during the cod- ing process. Fixed memory listless methods that exploit spectral redundancies enable e cient coding while maintaining rate scalability and progressive transmission. The second part of the thesis addresses image compression using directional filters in the wavelet domain. A directional lter is expected to improve the retention of edge and curve information during compression. Current implementations of hybrid wavelet and directional (HWD) lters improve the contour representation of compressed images, but su er from the pseudo-Gibbs phenomenon in the smooth regions of the images. A di erent approach to directional lters in the wavelet transforms is proposed to remove such artifacts while maintaining the ability to preserve contours and texture. Imple- mentation with grayscale images shows improvements in terms of distortion rates and the structural similarity, especially in images with contours. The proposed transform manages to preserve the directional capability without pseudo-Gibbs artifacts and at the same time reduces the complexity of wavelet transform with directional lter. Fur-ther investigation to colour images shows the transform able to preserve texture and curve.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Analysis of wavelet-based full reference image quality assessment algorithm

Measurement of Image Quality plays an important role in numerous image processing applications such as forensic science, image enhancement, medical imaging, etc. In recent years, there is a growing interest among researchers in creating objective Image Quality Assessment (IQA) algorithms that can correlate well with perceived quality. A significant progress has been made for full reference (FR) IQA problem in the past decade. In this paper, we are comparing 5 selected FR IQA algorithms on TID2008 image datasets. The performance and evaluation results are shown in graphs and tables. The results of quantitative assessment showed wavelet-based IQA algorithm outperformed over the non-wavelet based IQA method except for WASH algorithm which the prediction value only outperformed for certain distortion types since it takes into account the essential structural data content of the image

A Survey of Iris Recognition System

The uniqueness of iris texture makes it one of the reliable physiological biometric traits compare to the other biometric traits. In this paper, we investigate a different level of fusion approach in iris image. Although, a number of iris recognition methods has been proposed in recent years, however most of them focus on the feature extraction and classification method. Less number of method focuses on the information fusion of iris images. Fusion is believed to produce a better discrimination power in the feature space, thus we conduct an analysis to investigate which fusion level is able to produce the best result for iris recognition system. Experimental analysis using CASIA dataset shows feature level fusion produce 99% recognition accuracy. The verification analysis shows the best result is GAR = 95% at the FRR = 0.1

Palmprint Recognition using Principle Component Analysis Implemented on TMS320C6713 DSP Processor

This paper presents a human identification system using eigen-palm images. The proposed method consists of three main stages. The preprocessing stage computes the palmprint images to capture important information and produce a better representation of palmprint image data. The second stage extracts significant features from palmprint images and reduces the dimension of the palmprint image data by applying the principal component analysis (PCA) technique. Low-dimensional features in the feature space are assumed to be Gaussian. Thus, the Euclidean distance classifier can be used in the matching process to compare test image with the template. The proposed method is tested using a benchmark PolyU dataset. Experimental results show that the best achieved recognition rate is 97.5% when the palmprint image is represented using 34 PCA coefficients. Moreover, the Euclidean distance classifier is implemented on a digital signal processor (DSP) board. Implementing the proposed algorithm using the DSP processor achieves better performance in computation time compared with a personal computer-based syste

Palmprint Recognition Using Different Level of Information Fusion

The aim of this paper is to investigate a fusion approach suitable for palmprint recognition. Several number of fusion stageis analyse such as feature, matching and decision level. Fusion at feature level is able to increase discrimination power in the feature space by producing high dimensional fuse feature vector. Fusion at matching score level utilizes the matching output from different classifier to form a single value for decision process. Fusion at decision level on the other hand utilizes minimal information from a different matching process and the integration at this stage is less complex compare to other approach. The analysis shows integration at feature level produce the best recognition rates compare to the other method

A New Perceptual Mapping Model Using Lifting Wavelet Transform

Perceptual mappingapproaches have been widely used in visual information processing in multimedia and internet of things (IOT) applications. Accumulative Lifting Difference (ALD) is proposed in this paper as texture mapping model based on low-complexity lifting wavelet transform, and combined with luminance masking for creating an efficient perceptual mapping model to estimate Just Noticeable Distortion (JND) in digital images. In addition to low complexity operations, experiments results show that the proposed modelcan tolerate much more JND noise than models proposed befor

Exploiting chrominance planes similarity on listless quadtree coders

This study proposes an efficient algorithm for colour image compression with listless implementation based on set partition block embedded coding (SPECK). The objective of this work is to develop an algorithm that exploits the redundancy in colour spaces, low complexity quadtree partitioning and reduced memory requirements. Colour images are first transformed into luminance chrominance (YCbCr) planes and a wavelet transform is applied. A reduction of the memory requirement is achieved with the introduction of a state marker that matches each colour plane to eliminate the list with dynamic memory in the original colour SPECK coder (CSPECK). The wavelet coefficients are scanned using Z-order that matches the subband decompositions. The proposed algorithm then encodes the de-correlated colour plane as one unit and generates a mixed bit stream. The linear indexing and initial state marker are modified to jointly test the chrominance plane together. Composite colour coding enables precise control of the bit rate. The performance of the proposed algorithm is comparable with CSPECK, set partitioning in hierarchical trees (SPIHT) and JPEG2000 but with less memory requirements. For progressive lossless, a saving of more than 70\% than final working memory against CSPECK and SPIHT highlights the benefit of the proposed algorithm

Efficient implementation of 3D listless SPECK

This paper proposes an efficient algorithm for 3D image compression based on Set Partitioned Embedded Block Coding (SPECK). The new algorithm operates without a linked list and is suitable for implementation via hardware applications. 3D listless SPECK has a fixed, predetermined memory requirement that is larger than that required for the image alone. In the new developed algorithm, instead of a list, a state table with four bits per coefficient keeps track of the set partitions and the information that has been encoded. Sparse marking is applied to the selected block nodes of insignificant blocks in the state table. In this way, a large group of predictable insignificant coefficients can be identified and skipped during the coding process. The performance of the proposed listless algorithm is compared with 3D SPECK and the results obtained suggest that the proposed algorithm performs better for several images at various bit rates